On a Subroutine for Covering Zeros in Hungarian Algorithm
نویسندگان
چکیده
منابع مشابه
A cross entropy algorithm for continuous covering location problem
Covering problem tries to locate the least number of facilities and each demand has at least one facility located within a specific distance.This paper considers a cross entropy algorithm for solving the mixed integer nonlinear programming (MINLP) for covering location model.The model is solved to determine the best covering value.Also, this paper proposes aCross Entropy (CE) algorithm consider...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملpassivity in waiting for godot and endgame: a psychoanalytic reading
this study intends to investigate samuel beckett’s waiting for godot and endgame under the lacanian psychoanalysis. it begins by explaining the most important concepts of lacanian psychoanalysis. the beckettian characters are studied regarding their state of unconscious, and not the state of consciousness as is common in most beckett studies. according to lacan, language plays the sole role in ...
A Memory-Efficient Algorithm for Vertex Covering on Huge Graphs
C1. The input graph cannot be modified; its integrity must be preserved. C2. The processing unit has a “small” memory space (compared to the huge size of the graph). C3. The solution must be sent piece by piece to an external memory as soon as it is produced. Constraint C2 implies that the graph cannot be loaded into the memory of the processing unit. The constraint C3 comes from the fact that ...
متن کاملA terrain-covering algorithm for an AUV
An eecient, on-line terrain-covering algorithm is presented for a robot (AUV) moving in an unknown three-dimensional underwater environment. Such an algorithm is necessary for producing mosaicked images of the ocean oor. The basis of this three-dimensional motion planning algorithm is a new planar algorithm for nonsimply connected areas with boundaries of arbitrary shape. We show that this algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pamukkale University Journal of Engineering Sciences
سال: 2012
ISSN: 1300-7009
DOI: 10.5505/pajes.2012.30502